Applications of Fair Testing

In this paper we present the application of the fair testing pre-order, introduced in a previous paper, to the speciication and analysis of distributed systems. This pre-order combines some features of the standard testing pre-orders, viz. the possibility to reene a speciication by the resolution of nondeterminism, with a powerful feature of standard observation congruence, viz. the fair abstraction from divergences. Moreover, it is a pre-congruence with respect to all standard process-algebraic combinators, thus allowing for the standard algebraic proof techniques by substitution and rewriting. In this paper we will demonstrate advantages of the fair testing pre-order by the application to a number of examples, including a scheduling problem, a version of the Alternating Bit-protocol, and fair communication channels.